The Big Match

The Big Match and the Paris Match

The Big Match in Small Space

In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is the well known Big Match of Gillete (1957). These games may not allow optimal strategies but they always have ε-optimal strategies. In this paper we design ε-o...

Beating a Finite Automaton in the Big Match

We look at the Big Match game, a variation of the repeated Matching Pennies game where if the first player plays tails the game ends with the first player receiving the last round's payoff. We study this game when the second player js implemented as a finite automaton. We show several results including: • If the first player knows the number of states of the second player's automaton then he ca...

The Impact of the First Goal in the Final Result of the Futsal Match

Among the many technical and tactical aspects of the behavior of players, the goals are the most studied. The goal is the key to success for teams and its analysis in all matches of a major futsal tournament (World Cup) that allows multiple assessments. The aim of this study was to analyze the impact of the first goal for the final result in the futsal match, identifying the team that scored th...

Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...